Self-Stabilizing Depth-First Token Passing on Rooted Networks
نویسندگان
چکیده
We present a deterministic distributed depth rst token passing protocol on a rooted network This protocol does not use either the processor identi ers or the size of the network but as sumes the existence of a distinguished processor called the root of the network The protocol is self stabilizing meaning that starting from an arbitrary state in response to an arbitrary perturbation modifying the memory state it is guaranteed to reach a state with no more than one token in the network The protocol implements a strictly fair token circulation during a round every processor obtains the token exactly once The proposed protocol has extremely small memory requirement only O bits of memory per incident network link
منابع مشابه
Color Optimal Self-Stabilizing Depth-First Token Circulation for Asynchronous Message-Passing Systems
Self-stabilization was rst introduced by Dijkstra. A distributed system is self-stabilizing if it can start in any state and recover itself a legitimate state in nite time. This is a very desirable property for systems to tolerate transient perturbations. This paper proposes a distributed self-stabilizing depth-rst token circulation protocol over uniform rooted message-passing systems. With suc...
متن کاملColor Optimal Self-Stabilizing Depth-First Token Circulation
The notion of self-stabilization was rst introduced by Dijkstra : it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. This paper proposes a self-stabilizing depth-rst token circulation protocol for uniform rooted networks. Such an algorithm is very convenient to obtain the mutual exclusion or to construct a spanning ...
متن کاملEeciency and Simplicity in Self-stabilizing Distributed Depth-first Token Circulation Algorithms
The self-stabilizing distributed depth-rst token circulation algorithms have many applications in distributed systems. The solution to this problem can be used to solve the mutual exclusion, spanning tree construction, synchronization, and many others. In this thesis, we propose several depth-rst token circulation algorithms for trees and arbitrary networks. The algorithms do not use the proces...
متن کاملHighly Space-Efficient Self-Stabilizing Depth-First Token Circulation for Trees
Self-stabilization was rst introduced by Dijkstra Dij74]: it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. Since Dijkstra original paper, the goal of many works has been to obtain self-stabilizing algorithms requiring the fewest possible number of states. A great deal of proposed algorithms are token circulations,...
متن کاملSnap-Stabilizing Depth-First Search on Arbitrary Networks
A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing depth-first search wave protocol for arbitrary rooted networks. In this protocol, a wave of computation is initiated by the root. In this wave, all the processors are sequentially visited in depth-first search order. After th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997